Elementary explicit types and polynomial time operations
نویسندگان
چکیده
This paper studies systems of explicit mathematics as introduced by Feferman [9, 11]. In particular, we propose weak explicit type systems with a restricted form of elementary comprehension whose provably terminating operations coincide with the functions on binary words that are computable in polynomial time. The systems considered are natural extensions of the first-order applicative theories introduced in Strahm [19, 20].
منابع مشابه
Digraph Polynomials for Counting Cycles and Paths
Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles and paths, respectively. They satisfy recurrence relations with respect to elementary edge or vertex operations. They are related to other polynomials and ca...
متن کاملSome New Results On the Hosoya Polynomial of Graph Operations
The Wiener index is a graph invariant that has found extensive application in chemistry. In addition to that a generating function, which was called the Wiener polynomial, who’s derivate is a q-analog of the Wiener index was defined. In an article, Sagan, Yeh and Zhang in [The Wiener Polynomial of a graph, Int. J. Quantun Chem., 60 (1996), 959969] attained what graph operations do to the Wiene...
متن کاملTutte polynomials of wheels via generating functions
We find an explicit expression of the Tutte polynomial of an $n$-fan. We also find a formula of the Tutte polynomial of an $n$-wheel in terms of the Tutte polynomial of $n$-fans. Finally, we give an alternative expression of the Tutte polynomial of an $n$-wheel and then prove the explicit formula for the Tutte polynomial of an $n$-wheel.
متن کاملTRIANGULAR FUZZY MATRICES
In this paper, some elementary operations on triangular fuzzynumbers (TFNs) are defined. We also define some operations on triangularfuzzy matrices (TFMs) such as trace and triangular fuzzy determinant(TFD). Using elementary operations, some important properties of TFMs arepresented. The concept of adjoints on TFM is discussed and some of theirproperties are. Some special types of TFMs (e.g. pu...
متن کاملElementary linear logic revisited for polynomial time and an exponential time hierarchy (extended version)
Elementary linear logic is a simple variant of linear logic, introduced by Girard and which characterizes in the proofs-as-programs approach the class of elementary functions (computable in time bounded by a tower of exponentials of fixed height). Other systems, like light linear logic have then been defined to capture in a similar way polynomial time functions, but at the price of either a mor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Log. Q.
دوره 55 شماره
صفحات -
تاریخ انتشار 2009